[20260203] BOJ / G5 / 랭퍼든 수열쟁이야!! / 한종욱 #1880
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/15918
🧭 풀이 시간
60분
👀 체감 난이도
✏️ 문제 설명
X, Y번째 수가 같은 길이 2n의 랭퍼든 수열의 개수를 출력하라
🔍 풀이 방법
X, Y번째 수는 고정이기 때문에, 해당 위치에 숫자를 고정하고 나머지 랭퍼든 수열을 직접 대입해 찾는다.
수열을 다 만들고 랭퍼든 수열인지 판단하기 보다는 랭퍼든 수열로 값을 채우면서 찾아가는게 맞다.
⏳ 회고
처음에 수열을 하나씩 다 만들다 보니 너무 오래걸리더라.